Convexity, critical points, and connectivity radius
نویسندگان
چکیده
منابع مشابه
Convexity and Log Convexity for the Spectral Radius
The starting point of this paper is a theorem by J. F. C. Kingman which asserts that if the entries of a nonnegative matrix are log convex functions of a variable then so is the spectral radius of the matrix. A related result of J. Cohen asserts that the spectral radius of a nonnegative matrix is a convex function of the diagonal elements. The first section of this paper gives a new, unified pr...
متن کاملCritical Communication Radius for Sink Connectivity in Wireless Networks
Inspired by the thermodynamic limit in random geometric graphs, we propose a notion of sink connectivity for wireless networks. The sink connectivity, denoted Cn, is defined as the fraction of nodes in the network that are connected to the sink. We will show in this paper that if n nodes are randomly placed in a disc of area A and each node’s radius chosen as rn = p Ad/(πn), then the resulting ...
متن کاملSingle Nucleotide Polymorphisms and Association Studies: A Few Critical Points
Uncovering DNA sequence variations that correlate with phenotypic changes, e.g., diseases, is the aim of sequence variation studies. Common types sequence variations are Single nucleotide polymorphism (SNP, pronounced snip).SNPs are the third-generation molecular marker. SNP represents a DNA sequence variant of a single base pair with the minor allele occurring in more than 1% of a given popula...
متن کاملThe starlikeness, convexity, covering theorem and extreme points of p-harmonic mappings
The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.
متن کاملAsymptotic critical transmission radius for k-connectivity in wireless ad hoc networks
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other’s transmission range. The critical transmission radius for -connectivity is the smallest such that if all nodes have the transmission radius , the induced topology is -connected. In this paper, we study the asymptotic criti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2019
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/14892